Maximal Length Common Non-intersecting Paths
نویسندگان
چکیده
Given a set P n of n points on the plane labeled with the integers f1; : : : ; ng, an increasing path of P n is a sequence of points i 1 < : : : < i k such that the polygonal path ob-1 is non-self intersecting. We show that any point set on the plane admits an increasing path of length at least p 2n. We also study the problem of nding the longest common increasing path of two convex point sets on the plane and give an O(n 2 log n) time algorithm to nd such a path.
منابع مشابه
Independent sets and non-augmentable paths in generalizations of tournaments
We study different classes of digraphs, which are generalizations of tournaments, to have the property of possessing a maximal independent set intersecting every non-augmentable path (in particular, every longest path). The classes are the arclocal tournament, quasi-transitive, locally in-semicomplete (out-semicomplete), and semicomplete k-partite digraphs. We present results on strongly intern...
متن کاملBicoloured Dyck Paths and the Contact Polynomial for n Non-Intersecting Paths in a Half-Plane Lattice
In this paper configurations of n non-intersecting lattice paths which begin and end on the line y = 0 and are excluded from the region below this line are considered. Such configurations are called Hankel n−paths and their contact polynomial is defined by ẐH 2r(n;κ) ≡ ∑r+1 c=1 |H (n) 2r (c)|κc where H (n) 2r (c) is the set of Hankel n-paths which make c intersections with the line y = 0 the lo...
متن کاملGraphs of edge-intersecting and non-splitting paths
The families of Edge Intersection Graphs of Paths in a tree (resp. in a grid) EPT (resp. EPG) are well studied graph classes. Recently we introduced the class of graphs of Edge-Intersecting and NonSplitting Paths in a Tree (ENPT) [2]. In this model, two vertices are adjacent if they represent two intersecting paths of a tree whose union is also a path. In this study we generalize this graph cla...
متن کاملIntersecting Families — Uniform versus Weighted
What is the maximal size of k-uniform r-wise t-intersecting families? We show that this problem is essentially equivalent to determine the maximal weight of non-uniform r-wise t-intersecting families. Some EKR type examples and their applications are included.
متن کاملGraphs of Edge-Intersecting Non-splitting Paths in a Tree: Towards Hole Representations - (Extended Abstract)
Given a tree and a set P of non-trivial simple paths on it, Vpt(P) is the VPT graph (i.e. the vertex intersection graph) of P, and Ept(P) is the EPT graph (i.e. the edge intersection graph) of the paths P of the tree T . These graphs have been extensively studied in the literature. Given two (edge) intersecting paths in a graph, their split vertices is the set of vertices having degree at least...
متن کامل